Analysis of adiscrete- time single server retrial queue with general retrial times, multiple vacations and statedependent arrivals
نویسندگان
چکیده
منابع مشابه
Discrete - Time / / 1 Retrial Queue with General Retrial Times , Working Vacations and Vacation Interruption
Abstract: We consider a discrete-time 1 X Geo G retrial queue with general retrial times, and introduce working vacations and vacation interruption policy into the retrial queue. Firstly, we analyze the stationary condition for the embedded Markov chain at the departure epochs. Secondly, using supplementary variable method, we obtain the stationary probability distribution and some performance ...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملAnalysis of Single Server Retrial Queue with Batch Arrivals, Two Phases of Heterogeneous Service and Multiple Vacations with N–Policy
⎯We consider a single server retrial queue with batch arrivals, two phases of heterogeneous service and multiple vacations with Npolicy. The primary arrivals find the server busy or doing secondary job (vacation) will join orbit (group of repeated calls). If the number of repeated calls in orbit is less than N, the server does the secondary job repeatedly until the retrial group size reaches N....
متن کاملPerformance Analysis of Single Server Retrial Queue with General Retrial Time, Impatient Subscribers, Two Phases of Service and Bernoulli Schedule
This paper analyses the steady state behaviour of an M/G/1 retrial queue with impatient subscribers, two phases of essential service, general retrial time and general vacation time. If the primary call, on arrival finds the server busy, becomes impatient and leaves the system with probability (1 ) and with probability , it enters into an orbit. The server provides preliminary first essential se...
متن کاملstochastic bounds for a single server queue with general retrial times
we propose to use a mathematical method based on stochastic comparisons of markov chains in order to derive performance indice bounds. the main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (fcfs) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IOSR Journal of Mathematics
سال: 2017
ISSN: 2319-765X,2278-5728
DOI: 10.9790/5728-1302020108